On-line String Matching in Highly Similar DNA Sequences
نویسندگان
چکیده
منابع مشابه
On-line String Matching in Highly Similar DNA Sequences
We consider the problem of on-line exact string matching of a pattern in a set of highly similar sequences. This can be useful in cases where indexing the sequences is not feasible. We present a preliminary study by restricting the problem for a specific case where we adapt the classical Morris-Pratt algorithm to consider borders with errors. We give an original algorithm for computing borders ...
متن کاملOn-Line Pattern Matching on Similar Texts
Pattern matching on a set of similar texts has received much attention, especially recently, mainly due to its application in cataloguing human genetic variation. In particular, many different algorithms have been proposed for the off-line version of this problem; that is, constructing a compressed index for a set of similar texts in order to answer pattern matching queries efficiently. However...
متن کاملQuerying highly similar sequences
In this paper, we present a solution to the extreme similarity sequencing problem. The extreme similarity sequencing problem consists of finding occurrences of a pattern p in a set S(0), S(1), , S(k), of sequences of equal length, where S(i), for all 1≤i≤k, differs from S(0) by a constant number of errors - around 10 in practice. We present an asymptotically fast O(n + occ logocc) time algorit...
متن کاملHighly similar noncoding genomic DNA sequences: ultraconserved, or merely widespread?
In this note, I propose an explanation for the seeming contradiction between bioinformatics-based predictions of an essential function for ultraconserved DNA sequences, and the lack of an experimental demonstration of such function.
متن کاملOn-line fuzzy pattern matching on sequences
We consider pattern matching problems where patterns are presented as sequences of fuzzy constraints on input elements. Given an infinite alphabet A, a pattern P [α,β] is a sequence μi1 , μi2 , ..., μim ® of membership functions μij defined on A. The pattern P fuzzy matches an input sequence t ∈ A∗ if t = ux1x2 · · ·xmv such that
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2017
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-016-0280-2